Zero Decomposition with Multiplicity of Zero-Dimensional Polynomial Systems
نویسندگان
چکیده
We present a zero decomposition theorem and an algorithm based on Wu’s method, which computes a zero decomposition with multiplicity for a given zerodimensional polynomial system. If the system satisfies some condition, the zero decomposition is of triangular form.
منابع مشابه
Analyzing Multiplicities of a Zero-dimensional Regular Set's Zeros Using Pseudo Squarefree Decomposition
In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set’s zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition of multivariate polynomials, and then propose an algorithm for decomposing a regular set into a finite number of simple sets. From the output of this algori...
متن کاملGeneric regular decompositions for parametric polynomial systems
This paper presents a generalization of our earlier work in [19]. In this paper, the two concepts, generic regular decomposition (GRD) and regular-decomposition-unstable (RDU) variety introduced in [19] for generic zero-dimensional systems, are extended to the case where the parametric systems are not necessarily zero-dimensional. An algorithm is provided to compute GRDs and the associated RDU ...
متن کاملSolving Degenerate Sparse Polynomial Systems Faster
Consider a system F of n polynomial equations in n unknowns, over an algebraically closed eld of arbitrary characteristic. We present a fast method to nd a point in every irreducible component of the zero set Z of F. Our techniques allow us to sharpen and lower prior complexity bounds for this problem by fully taking into account the monomial term structure. As a corollary of our development we...
متن کاملThe 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial
Let G be a graph of order n, maximum degree ∆ and minimum degree δ. Let P (G,λ) be the chromatic polynomial of G. It is known that the multiplicity of zero ‘0’ of P (G,λ) is one if G is connected; and the multiplicity of zero ‘1’ of P (G,λ) is one if G is 2-connected. Is the multiplicity of zero ‘2’ of P (G,λ) at most one if G is 3-connected? In this paper, we first construct an infinite family...
متن کاملSolving piecewise polynomial constraint systems with decomposition and a subdivision-based solver
Boris van Sosin Computer Science Department, Technion-Israel Institute of Technology Solving Piecewise Polynomial Constraint Systems with Decomposition using Subdivision-Based Solver Piecewise polynomial constraint systems are common in numerous problems in computational geometry, such as constraint programming, modeling, and kinematics. In this talk, we present a framework that is capable of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1011.1634 شماره
صفحات -
تاریخ انتشار 2010